Optimal Morphs of Convex Drawings

We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity. The linear bound is asymptotically optimal in the worst case.Comment: To appear in SoCG 201

DEFINITION OF AN ASSESSMENT FRAMEWORK FOR PROJECTS OF COMMON INTEREST IN THE FIELD OF SMART GRIDS under the EC "Proposal for a regulation of the European Parliament and of the Council on guidelines for trans-European energy infrastructure"

The document presents the methodology to be adopted in the evaluation of proposals of Smart Grids projects to be awarded the label of Projects of Common Interest. The label, established by the Regulation 347/2013 on Guidelines for trans-European energy infrastructure, aims at identifying trans-national projects with a significant added-value for the EU as a whole. The methodology has been developed by JRC within the Expert Group 4 "Infrastructure" of the EC Smart Grids Task Force and finally approved by the Expert Group in July 2012.JRC.F.3-Energy Security, Systems and Marke

High‐Speed Deterministic‐Latency Serial IO

In digital systems, serial IO at speeds in the range from 1 to 20 Gbps is realized by means of dedicated transceivers, named serializer-deserializers (SerDeses). In general, due to their internal architecture, the data transfer delay, or the latency, may vary after a reset of the device. On the other hand, some applications, such as high-speed transfer protocols for analog-to-digital and digital-to-analog converters, trigger and data acquisition systems, clock distribution, synchronization and control of radio equipment need this delay to be constant at each reset. In this chapter, we focus on a serial IO architecture based on configurable transceivers embedded in field-programmable gate arrays (FPGAs). We will show how it is possible to achieve deterministic-latency operation in a line-code-independent way. As a case study, we will consider a synchronous 2.5-Gbps serial link based on an 8b10b line code

Floristic survey of the former royal hunting reserve of Renda, near Palermo (Sicily, Italy)

A mountainous area in western Sicily, where relic wood vegetation is still preserved notwithstanding past and present human pressure, is here analysed in order to prepare a checklist of its vascular flora. Field investigations allowed to compile a floristic inventory including 601 infrageneric taxa belonging to 304 genera and 80 families. Some remarks on the biological and chorological spectra are presented, and some measures to protect flora and vegetation are suggested, too

Relaxing the Constraints of Clustered Planarity

In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or region-region crossings. Determining the complexity of testing whether a clustered graph admits a c-planar drawing is a long-standing open problem in the Graph Drawing research area. An obvious necessary condition for c-planarity is the planarity of the graph underlying the clustered graph. However, such a condition is not sufficient and the consequences on the problem due to the requirement of not having edge-region and region-region crossings are not yet fully understood. In order to shed light on the c-planarity problem, we consider a relaxed version of it, where some kinds of crossings (either edge-edge, edge-region, or region-region) are allowed even if the underlying graph is planar. We investigate the relationships among the minimum number of edge-edge, edge-region, and region-region crossings for drawings of the same clustered graph. Also, we consider drawings in which only crossings of one kind are admitted. In this setting, we prove that drawings with only edge-edge or with only edge-region crossings always exist, while drawings with only region-region crossings may not. Further, we provide upper and lower bounds for the number of such crossings. Finally, we give a polynomial-time algorithm to test whether a drawing with only region-region crossings exist for biconnected graphs, hence identifying a first non-trivial necessary condition for c-planarity that can be tested in polynomial time for a noticeable class of graphs

Paradigmi penali ed ermeneutica giudiziale

La tesi affronta la problematica concernente il rapporto tra le acquisizioni della filosofia ermeneutica ed i postulati del principio di legalità. Da una prospettiva metodologica di integrazione tra politica criminale e dogmatica, la tesi cerca di sistematizzare i teoremi della filosofia ermeneutica nella costruzione illuministica del diritto penale del fatto, anche attraverso il confronto con gli ordinamenti sovranazionali. La tesi si conclude con l'esame delle ricadute processuali di una simile prospettiva

A modified applicative criterion of the physical model concept for evaluating plot soil erosion predictions

In this paper, the physical model concept by Nearing (1998. Catena 32: 15–22) was assessed. Soil loss data collected on plots of different widths (2–8 m), lengths (11–44 m) and steepnesses (14.9–26.0%), equipped in south and central Italy, were used. Differences in width between plots of given length and steepness determined a lower data correlation and more deviation of the fitted regression line from the identity one. A coefficient of determination between measured, M, and predicted, P, soil losses of 0.77 was representative of the best-case prediction scenario, according to Nearing (1998). The relative differences, Rdiff = (P − M) / (P + M), decreased in absolute value as M increased only for erosion rates approximately > 1 kg m− 2. An alternative applicative criterion of the physical model concept, based on the |P − M| difference, was valid for the entire range of measured soil losses. In conclusion, the physical model should be defined in terms of perfect planimetrical equivalence. The best applicative criterion of the physical model concept may vary with the considered dataset, which practically implies the need to further test this concept with other datasets

Emulating the GLink Chip-Set with FPGA Serial Transceivers in the ATLAS Level-1 Muon Trigger

Many High Energy Physics experiments based their serial links on the Agilent HDMP-1032/34A serializer/deserializer chip-set (or GLink). This success was mainly due to the fact that this pair of chips was able to transfer data at \sim 1 Gb/s with a deterministic latency, fixed after each power up or reset of the link. Despite this unique timing feature, Agilent discontinued the production and no compatible commercial off-the-shelf chip-sets are available. The ATLAS Level-1 Muon trigger includes some serial links based on GLink in order to transfer data from the detector to the counting room. The transmission side of the links will not be upgraded, however a replacement for the receivers in the counting room in case of failures is needed. In this paper, we present a solution to replace GLink transmitters and receivers. Our design is based on the gigabit serial IO (GTP) embedded in a Xilinx Virtex 5 Field Programmable Gate Array (FPGA). We present the architecture and we discuss parameters of the implementation such as latency and resource occupation. We compare the GLink chip-set and the GTP-based emulator in terms of latency, eye diagram and power dissipation

Benchmark Structures and Conformational Landscapes of Amino Acids in the Gas Phase: A Joint Venture of Machine Learning, Quantum Chemistry, and Rotational Spectroscopy

The accurate characterization of prototypical bricks of life can strongly benefit from the integration of high resolution spectroscopy and quantum mechanical computations. We have selected a number of representative amino acids (glycine, alanine, serine, cysteine, threonine, aspartic acid and asparagine) to validate a new computational setup rooted in quantum-chemical computations of increasing accuracy guided by machine learning tools. Together with low-lying energy minima, the barriers ruling their interconversion are evaluated in order to unravel possible fast relaxation paths. Vibrational and thermal effects are also included in order to estimate relative free energies at the temperature of interest in the experiment. The spectroscopic parameters of all the most stable conformers predicted by this computational strategy, which do not have low-energy relaxation paths available, closely match those of the species detected in microwave experiments. Together with their intrinsic interest, these accurate results represent ideal benchmarks for more approximate methods